From Tuple Spaces to Tuple Centres 1
نویسندگان
چکیده
A tuple centre is a Linda-like tuple space whose behaviour can be programmed by means of transactional reactions to the standard communication events. This paper de nes the notion of tuple centre, and shows the impact of its adoption as a coordination medium for a distributed multi-agent system on both the system design and the overall system e ciency.
منابع مشابه
Designing a BPEL Orchestration Engine Based on ReSpecT Tuple Centres
We present the design of a BPEL orchestration engine based on ReSpecT tuple centres, a coordination model extending Linda with the ability of declaratively programming the reactive behaviour of tuple spaces. Architectural and linguistic aspects of our solution are discussed, focussing on how the syntax and semantics of BPEL have been mapped to tuple centres. This is achieved by a translation of...
متن کاملExtending ReSpecT for Multiple Coordination Flows
In this paper, the ReSpecT specification language for programming the behaviour of tuple centres is extended with the out tc predicate, enabling communication between tuple centres. The extension is formally defined, and its benefits in the management of multiple coordination flows are outlined. The paper shows how relevant interaction scenarios – typically event-oriented – can be framed as mul...
متن کامل$k$-tuple total restrained domination/domatic in graphs
For any integer $kgeq 1$, a set $S$ of vertices in a graph $G=(V,E)$ is a $k$-tuple total dominating set of $G$ if any vertex of $G$ is adjacent to at least $k$ vertices in $S$, and any vertex of $V-S$ is adjacent to at least $k$ vertices in $V-S$. The minimum number of vertices of such a set in $G$ we call the $k$-tuple total restrained domination number of $G$. The maximum num...
متن کاملk-TUPLE DOMATIC IN GRAPHS
For every positive integer k, a set S of vertices in a graph G = (V;E) is a k- tuple dominating set of G if every vertex of V -S is adjacent to at least k vertices and every vertex of S is adjacent to at least k - 1 vertices in S. The minimum cardinality of a k-tuple dominating set of G is the k-tuple domination number of G. When k = 1, a k-tuple domination number is the well-studied domination...
متن کامل2-tuple intuitionistic fuzzy linguistic aggregation operators in multiple attribute decision making
In this paper, we investigate the multiple attribute decisionmaking (MADM) problems with 2-tuple intuitionistic fuzzylinguistic information. Then, we utilize arithmetic and geometricoperations to develop some 2-tuple intuitionistic fuzzy linguisticaggregation operators. The prominent characteristic of theseproposed operators are studied. Then, we have utilized theseoperators to develop some app...
متن کامل